Inclusion and equivalence between relational database schemata
نویسندگان
چکیده
منابع مشابه
Compiling Relational Database Schemata into Probabilistic Graphical Models
A majority of scientific and commercial data is stored in relational databases. Probabilistic models over such datasets would allow probabilistic queries, error checking, and inference of missing values, but to this day machine learning expertise is required to construct accurate models. Fortunately, current probabilistic programming tools ease the task of constructing such models [1, 2, 3, 4, ...
متن کاملTransmitting Relational Worldviews: The Relationship between Mother-Daughter Memorable Messages and Adult Daughters’ Romantic Relational Schemata
This study investigates memorable messages that daughters report hearing from their mothers about romantic relationships to examine the development of meaning in the content of parent-child communication and the ways in which these messages may affect and reflect adult daughters’ relational worldviews. Findings from a study involving 149 adult daughters revealed 4 supra-categories of memorable ...
متن کاملElementary Translations: The Seesaws for Achieving Traceability Between Database Schemata
There exist several recent approaches that leverages the use of model transformations during software development. The existence of different kinds of models, at different levels of abstraction, involves the necessity of transferring knowledge from one model to another. This framework can also be applied in the context of metadata management for database evolution, in which transformations are ...
متن کاملMatching Relational Schemata to Semantic Web Ontologies
The Semantic Web (SW; Berners-Lee, Hendler, & Lassila, 2001) is already in its implementation phase and an indication of this is the intense research and development activity in the area of SW tools and languages. SW is based on metadata, which describe the semantics of the Web content. SW envisages the enrichment of data with semantics in order to be machine understandable and enable knowledge...
متن کاملRelational Equivalence Proofs Between Imperative and MapReduce Algorithms
MapReduce frameworks are widely used for the implementation of distributed algorithms. However, translating imperative algorithms into these frameworks requires significant structural changes to the algorithm. As the costs of running faulty algorithms at scale can be severe, it is highly desirable to verify the correctness of the translation, i.e., to prove that the MapReduce version is equival...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1982
ISSN: 0304-3975
DOI: 10.1016/0304-3975(82)90038-x